859A - Declined Finalists - CodeForces Solution


greedy implementation *800

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int t;
    cin >> t;
    int mx = 0;
    for (int i = 0; i < t; i++)
    {
        int a;
        cin >> a;
        mx = max(a, mx);
    }
    cout << max(0, mx - 25);
    return 0;
}


Comments

Submit
0 Comments
More Questions

Lift queries
Goki and his breakup
Ali and Helping innocent people
Book of Potion making
Duration
Birthday Party
e-maze-in
Bricks Game
Char Sum
Two Strings
Anagrams
Prime Number
Lexical Sorting Reloaded
1514A - Perfectly Imperfect Array
580A- Kefa and First Steps
1472B- Fair Division
996A - Hit the Lottery
MSNSADM1 Football
MATCHES Playing with Matches
HRDSEQ Hard Sequence
DRCHEF Doctor Chef
559. Maximum Depth of N-ary Tree
821. Shortest Distance to a Character
1441. Build an Array With Stack Operations
1356. Sort Integers by The Number of 1 Bits
922. Sort Array By Parity II
344. Reverse String
1047. Remove All Adjacent Duplicates In String
977. Squares of a Sorted Array
852. Peak Index in a Mountain Array